Image Size Invariant Visual Cryptography
نویسندگان
چکیده
In the visual secret sharing scheme proposed by Naor and Shamir [3], a secret image is encoded into shares, of which size is larger than that of the secret image and the shares are decoded by stacking them without performing any cryptographic computation. In this paper we propose a (k, n) visual secret sharing scheme to encode a black-and-white image into the same size shares as the secret image, where the reconstructed image of the proposed scheme is visible as well as that of the conventional scheme. key words: secret sharing, visual secret sharing, visual cryptography
منابع مشابه
On the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
متن کاملEnhancing the Perceived Visual Quality of a Size Invariant Visual Cryptography Scheme
Two of the main areas of research in visual cryptography have been on improving the visual quality of the recovered image and in reducing the pixel expansion of the shares. This paper addresses both of these visual cryptography issues. First, a method to enhance the perceived visual quality of the recovered image using various image filtering techniques is presented. In particular, these image ...
متن کاملمطالعهای بر رمزنگاری بصری و ارائهی روش پیشنهادی برای رمزنگاری تصاویر رنگی
Visual cryptography is a method that makes use of the characteristics of human vision and it requires neither the knowledge of cryptography nor the complex calculations. This method was first proposed by Naor and Shamir, its implementation is simple, it has been extended to an secrect sharing (k, n) in which n shares are made from the image and they are distributed among n participants. Moreov...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملMAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کامل